Section: New Results

From control flow analysis to complexity

Participant : Jean-Yves Marion.

Jean-Yves Marion proposed a type system for an imperative programming language which certifies time bounds in [27] . It is based on secure flow information analysis as proposed for instance by Bell and La Padula. Thus, a link is done between computational complexity and security-typed languages.